Detecting Invisible Relevant Persons in a Homogeneous Social Network
نویسندگان
چکیده
An algorithm to detect invisible relevant persons in a homogeneous social network is studied with computer simulation. The network is effective as a model for contemporary inter-working terrorists where large hub persons do not exist. Absense of large hub persons results in that the observed communication flow is also homogeneous. Clues regarding invisible relevant persons are hardly found in communication records. This task is, therefore, generally difficult. We demonstrate that our algorithm identifies the portion of the market baskets representing communication records, where invisible relevant persons are likely to be hidden, with good precision.
منابع مشابه
Detecting Overlapping Communities in Social Networks using Deep Learning
In network analysis, a community is typically considered of as a group of nodes with a great density of edges among themselves and a low density of edges relative to other network parts. Detecting a community structure is important in any network analysis task, especially for revealing patterns between specified nodes. There is a variety of approaches presented in the literature for overlapping...
متن کاملA Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring
All the social networks can be modeled as a graph, where each roles as vertex and each relationroles as an edge. The graph can be show as G = [V;E], where V is the set of vertices and E is theset of edges. All social networks can be segmented to K groups, where there are members in eachgroup with same features. In each group each person knows other individuals and is in touch ...
متن کاملDetection of invisible nodes in a homogeneous network
Crystallization algorithm to detect invisible nodes in a homogeneous network is studied. The homogeneous network does not possess very large hub nodes. The portion of the data generated from a simulation model, where the invisible nodes are likely to exist, is identified with good precision. This demonstrates that the human-interactive annealing along with the crystallization algorithm can be a...
متن کاملPredicting relevant empty spots in social interaction
An empty spot refers to an empty hard-to-fill space which can be found in the records of the social interaction, and is the clue to the persons in the underlying social network who do not appear in the records. This contribution addresses a problem to predict relevant empty spots in social interaction. Homogeneous and inhomogeneous networks are studied as a model underlying the social interacti...
متن کاملNode discovery problem for a social network
This paper presents a practical heuristic algorithm to address a node discovery problem. The node discovery problem is to discover a clue on the person, who does not appear in the observed records, but is relevant functionally in affecting decision-making and behavior of an organization. We define two topological relevance of a node in a social network (global and local relevance). Association ...
متن کامل